Removing redundant arguments automatically

Removing redundant arguments automatically

The application of automatic transformation processes during the formal development and optimization of programs can introduce encumbrances in the generated code that programmers usually (or presumably) do not write. An example is the introduction of redundant arguments in the functions defined in the program. Redundancy of a parameter means that replacing it by any expression does not change t...

Serializing Parallel Programs by Removing Redundant Computation

Programs often exhibit more parallelism than is actually available in the target architecture. This thesis introduces and evaluates three methods|loop unrolling, loop common expression elimination, and loop di erencing|for automatically transforming a parallel algorithm into a less parallel one that takes advantage of only the parallelism available at run time. The resulting program performs le...

Redundant Arguments in Innnitary Rewriting (extended Abstract) ?

Automatically Identifying the Arguments of Discourse Connectives

Removing the Strong RSA Assumption from Arguments over the Integers

Committing integers and proving relations between them is an essential ingredient in many cryptographic protocols. Among them, range proofs have shown to be fundamental. They consist in proving that a committed integer lies in a public interval, which can be seen as a particular case of the more general Diophantine relations: for the committed vector of integers x, there exists a vector of inte...